Refutation of Aslam's Proof that NP = P
نویسندگان
چکیده
Aslam presents an algorithm he claims will count the number of perfect matchings in any incomplete bipartite graph with an algorithm in the function-computing version of NC, which is itself a subset of FP. Counting perfect matchings is known to be #P-complete; therefore if Aslam's algorithm is correct, then NP=P. However, we show that Aslam's algorithm does not correctly count the number of perfect matchings and offer an incomplete bipartite graph as a concrete counter-example.
منابع مشابه
Response to Refutation of Aslam's Proof that NP = P
We present a resolution to the refutation provided by Ferraro et. al (arxiv.org, May 2009), for the proof of NP = P in [Aslam, arxiv.org, March 2009]. We also provide a correct solution to the counter example and additional results that explain why some issues raised in the cited refutation are not quite valid. 1 Preserving ER over a VMP Set The authors’ conclusion is valid in pointing out the ...
متن کاملFinding a tree structure in a resolution proof is NP-complete
The resolution tree problem is to decide whether a given sequencelike resolution refutation admits a tree structure. This paper shows the NP-completeness of both the resolution tree problem and a natural generalization of the resolution tree problem that does not involve resolution.
متن کاملRefutation of random constraint satisfaction problems using the sum of squares proof system
Given a k-ary predicate P, a random instance of a constraint satisfaction problem with predicate P (CSP(P)) is a set of m constraints on n variables. Each constraint is P applied to k random literals. Such an instance is unsatisfiable with high probability when m >> n. Refutation is certifying that a given randomly chosen instance is unsatisfiable. This task has applications in cryptography, ha...
متن کاملImplicit Resolution
Let Ω be a set of unsatisfiable clauses, an implicit resolution refutation of Ω is a circuit β with a resolution proof α of the statement “β describes a correct tree-like resolution refutation of Ω”. We show that such a system is p-equivalent to Extended Frege. More generally, let τ be a tautology, a [P,Q]-proof of τ is a pair (α, β) s.t. α is a P -proof of the statement “β is a circuit describ...
متن کاملSurvey on Proof Complexity
In this survey, I will discuss two results in proof complexity. Proof complexity studies the efficiency of particular formal proof systems for proving particular formulas. The work in this area has focused on propositional logic, since results about it have a direct connection to central questions in complexity theory. In particular, we know that NP = co − NP if there is a proof system that has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0904.3912 شماره
صفحات -
تاریخ انتشار 2009